On an Extremal Problem Concerning Intervals
نویسندگان
چکیده
منابع مشابه
On an Extremal Problem concerning Primitive Sequences
A sequence a,< . . . of integers is called primitive if no a divides any other . (a 1 < . . . will always denote a primitive sequence .) It is easy to see that if a i < . . . < a,,, < n then max k = [(n + 1) /2] . The following question seems to be very much more difficult . Put f(n) =niax E 1) , a,, where the maximum is taken over all primitive sequences all of wliose terms are not exceeding n...
متن کاملAn extremal problem on crossing vectors
Article history: Received 9 October 2013 Available online xxxx
متن کاملOn an extremal problem for poset dimension
Let f(n) be the largest integer such that every poset on n elements has a 2-dimensional subposet on f(n) elements. What is the asymptotics of f(n)? It is easy to see that f(n) > n. We improve the best known upper bound and show f(n) = O(n). For higher dimensions, we show fd(n) = O ( n d d+1 ) , where fd(n) is the largest integer such that every poset on n elements has a d-dimensional subposet o...
متن کاملExtremal problems concerning Kneser graphs
Let d and S? be two intersecting families of k-subsets of an n-element set. It is proven that l~.JuS?l <(;:i)+(;::) holds for n>f(3+,/?)k, and equality holds only if there exist two points a, b such that {a, b} n F# 0 for all FE d u g, For n=2k+o(Jj;) an example showing that in this case max 1 d u B 1 = (1 o( 1 ))( ;) is given. This disproves an old conjecture of Erdiis [7]. In the second part ...
متن کاملAn Extremal Problem for Polynomials
Let f(z) = z" Hbe a polynomial such that the level set E = {z : |/(z)| < 1} is connected. Then max{|/'(z)| : z e E} < 2<1/")-1n2 , and this estimate is the best possible. The following question was asked in [1, Problem 4.8]. Let f be a polynomial of degree n, (1) f{z)~z», z^oo. Put Ef = {z : \f(z)\ < 1} , and assume that Ef is connected. Is it true that (2) max{\f'(z)\:z£Ef}. Pommerenke ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1982
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(82)80033-4